[4] N. Friedman, M. Linial, I. Nachman, and D. Pe’er. Using Bayesian networks
نویسندگان
چکیده
SLAM: cross-species gene finding and alignment with a generalized pair hidden Markov model. Bayesian approach to reconstructing genetic regulatory networks with hidden factors. to analyze expression data. Estimation of genetic networks and functional structures between genes by using Bayesian networks and non-parametric regression. network and nonparametric heteroscedastic regression for nonlinear modeling of genetic network. network and nonparametric heteroscedastic regression for nonlinear modeling of genetic network.
منابع مشابه
Gaussian Process Networks
In this paper we address the problem of learning the structure of a Bayesian network in domains with continuous variables. This task requires a procedure for comparing different candidate structures. In the Bayesian framework, this is done by evaluating the marginal likelihood of the data given a candidate structure. This term can be computed in closed-form for standard parametric families (e.g...
متن کامل"Ideal Parent" Structure Learning for Continuous Variable Networks
In recent years, there is a growing interest in learning Bayesian networks with continuous variables. Learning the structure of such networks is a computationally expensive procedure, which limits most applications to parameter learning. This problem is even more acute when learning networks with hidden variables. We present a general method for significantly speeding the structure search algor...
متن کامل Structure Learning in Bayesian Networks Using Asexual Reproduction Optimization
A new structure learning approach for Bayesian networks (BNs) based on asexual reproduction optimization (ARO) is proposed in this letter. ARO can be essentially considered as an evolutionary based algorithm that mathematically models the budding mechanism of asexual reproduction. In ARO, a parent produces a bud through a reproduction operator; thereafter the parent and its bud compete to survi...
متن کاملSpectra of Lifted Ramanujan Graphs
A random n-lift of a base graph G is its cover graph H on the vertices [n]×V (G), where for each edge uv in G there is an independent uniform bijection π, and H has all edges of the form (i, u), (π(i), v). A main motivation for studying lifts is understanding Ramanujan graphs, and namely whether typical covers of such a graph are also Ramanujan. Let G be a graph with largest eigenvalue λ1 and l...
متن کامل"Ideal Parent" Structure Learning for Continuous Variable Bayesian Networks
Bayesian networks in general, and continuous variable networks in particular, have become increasingly popular in recent years, largely due to advances in methods that facilitate automatic learning from data. Yet, despite these advances, the key task of learning the structure of such models remains a computationally intensive procedure, which limits most applications to parameter learning. This...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009